On Kosloff Tal-Ezer least-squares quadrature formulas
نویسندگان
چکیده
Abstract In this work, we study a global quadrature scheme for analytic functions on compact intervals based function values quasi-uniform grids of nodes. practice it is not always possible to sample at optimal nodes that give well-conditioned and quickly converging interpolatory rules the same time. Therefore, go beyond classical by lowering degree polynomial approximant applying auxiliary mapping map original more suitable fake More precisely, investigate combination Kosloff Tal-Ezer least-squares approximation (KTL) numerical quadrature: careful selection parameter ensures stability scheme, high accuracy and, time, an asymptotically ratio between spacing grid. We will properties KTL focus symmetry weights, limit relations parameter, as well computation weights in standard monomial Chebyshev bases with help cosine transform. Numerical tests equispaced show static choice map’s improve results composite trapezoidal rule, while dynamic approach achieves larger faster convergence, even when sampling are perturbed. From computational point view proposed method practical can be implemented simple efficient way.
منابع مشابه
Discrete Least Squares and Quadrature Formulas
The purpose of this paper is two-fold. Firstly, we explore some of the intimate connections between discrete least squares processes and quadratures. Secondly, we present an algorithm to construct Gauss-type integration formulas, and consider briefly the method proposed by Gautschi [2].
متن کاملOn Birkhoff Quadrature Formulas
In an earlier work the author has obtained new quadrature formulas (see (1.3)) based on function values and second derivatives on the zeros of nn(i) as defined by (1.2). The proof given earlier was quite long. The object of this paper is to provide a proof of this quadrature formula which is extremely simple and indeed does not even require the use of fundamental polynomials of (0,2) interpolat...
متن کاملNew quadrature formulas from conformal maps by Nicholas Hale
Gauss and Clenshaw–Curtis quadrature, like Legendre and Chebyshev spectral methods, make use of grids strongly clustered at boundaries. From the viewpoint of polynomial approximation this seems necessary and indeed in certain respects optimal. Nevertheless such methods may “waste” a factor of π/2 with respect to each space dimension. We propose new nonpolynomial quadrature methods that avoid th...
متن کاملNew Quadrature Formulas from Conformal Maps
Gauss and Clenshaw–Curtis quadrature, like Legendre and Chebyshev spectral methods, make use of grids strongly clustered at boundaries. From the viewpoint of polynomial approximation this seems necessary and indeed in certain respects optimal. Nevertheless such methods may “waste” a factor of π/2 with respect to each space dimension. We propose new nonpolynomial quadrature methods that avoid th...
متن کاملUnifying Least Squares, Total Least Squares and Data Least Squares
The standard approaches to solving overdetermined linear systems Ax ≈ b construct minimal corrections to the vector b and/or the matrix A such that the corrected system is compatible. In ordinary least squares (LS) the correction is restricted to b, while in data least squares (DLS) it is restricted to A. In scaled total least squares (Scaled TLS) [15], corrections to both b and A are allowed, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bit Numerical Mathematics
سال: 2023
ISSN: ['0006-3835', '1572-9125']
DOI: https://doi.org/10.1007/s10543-023-00948-0